The Security Assignment Problem and Its Solution

In this paper we derived a new method for finding the optimal solution to security assignment problems using projection onto convex set. This study will help communities find number of assigned and reserved personnels in designating officers an area. is applicable as well CCTV problems. The main goal give that can be applied solving We used some known properties optimization proving solution, such concept proximity operator, set, primal dual problem. addition that, basic knowledge graph theory answer our real-life application study. results showed found instances when problem exists solutions exist, determine explicitly. Also, proved there always Pseudo-solution problems, if exists, then coincide with it. most important aspect introduction